Grokking Oracle Coding Interview
Rate this course
Ask Author
Contribute
Back to course home

0% completed

Vote For New Content
Introduction
Who Should Take This Course?
Oracle Easy
Count Number of Pairs With Absolute Difference K (easy)
Solution: Count Number of Pairs With Absolute Difference K
Degree of an Array (easy)
Solution: Degree of an Array
Find Subsequence of Length K With the Largest Sum (easy)
Solution: Find Subsequence of Length K With the Largest Sum
Rectangle Overlap (easy)
Solution: Rectangle Overlap
Remove All Adjacent Duplicates In String (easy)
Solution: Remove All Adjacent Duplicates In String
Island Perimeter (easy)
Solution: Island Perimeter
Climbing Stairs (easy)
Solution: Climbing Stairs
Move Zeroes (easy)
Solution: Move Zeroes
Excel Sheet Column Title (easy)
Solution: Excel Sheet Column Title
Valid Parentheses (Easy)
Solution: Valid Parentheses
Oracle Medium
Longest Palindromic Substring (medium)
Solution: Longest Palindromic Substring
Single Element in a Sorted Array (medium)
Solution: Single Element in a Sorted Array
Pairs of Songs With Total Durations Divisible by 60 (medium)
Solution: Pairs of Songs With Total Durations Divisible by 60
Search a 2D Matrix II (medium)
Solution: Search a 2D Matrix II
Minimize Maximum of Array (medium)
Solution: Minimize Maximum of Array
Asteroid Collision (medium)
Solution: Asteroid Collision
Combination Sum (medium)
Solution: Combination Sum
Binary Tree Right Side View (medium)
Solution: Binary Tree Right Side View
Sort Colors (medium)
Solution: Sort Colors
Group Anagrams (Medium)
Solution: Group Anagrams
Decode String (Medium)
Solution: Decode String
Number of Islands (medium)
Solution: Number of Islands
Binary Tree Zigzag Level Order Traversal (medium)
Solution: Binary Tree Zigzag Level Order Traversal
Longest Common Subsequence (medium)
Solution: Longest Common Subsequence
Rotting Oranges (medium)
Solution: Rotting Oranges
Meeting Rooms II (medium)
Solution: Meeting Rooms II
Delete Node in a BST (medium)
Solution: Delete Node in a BST
Remove Duplicate Letters (medium)
Solution: Remove Duplicate Letters
Longest Substring Without Repeating Characters (medium)
Solution: Longest Substring Without Repeating Characters (medium)
Search in Rotated Array (medium)
Solution: Search in Rotated Array
Spiral Matrix (medium)
Solution: Spiral Matrix
Container With Most Water (Medium)
Solution: Container With Most Water
3Sum (medium)
Solution: 3Sum
Simplify Path (medium)
Solution: Simplify Path
Next Permutation (medium)
Solution: Next Permutation
Basic Calculator II (medium)
Solution: Basic Calculator II
Merge Intervals (medium)
Solution: Merge Intervals
Restore IP Addresses (medium)
Solution: Restore IP Addresses
Longest Increasing Subsequence (medium)
Solution: Longest Increasing Subsequence
Validate Binary Search Tree (medium)
Solution: Validate Binary Search Tree
Integer to English Words (hard)
Solution: Integer to English Words
Trapping Rain Water (hard)
Solution: Trapping Rain Water
First Missing Positive (hard)
Solution: First Missing Positive
Merge K Sorted Lists (hard)
Solution: Merge K Sorted Lists
Max Points on a Line (hard)
Solution: Max Points on a Line
Sudoku Solver (hard)
Solution: Sudoku Solver
Longest Valid Parentheses (hard)
Solution: Longest Valid Parentheses
Remove Nth Node From End of List (Medium)
Solution: Remove Nth Node From End of List
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Constrained Subsequence Sum (hard)
Solution: Constrained Subsequence Sum
Solution: Longest Common Subsequence

Problem Statement

Given two strings 's1' and 's2', find the length of the longest subsequence which is common in both the strings.

A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.

Example 1:

Input: s1 = "abdca"
       s2 = "cbda"
Output: 3
Explanation: The longest common subsequence is "bda".

Example 2:

Input: s1 = "passport"
       s2 = "ppsspt"
Output: 5
Explanation: The longest common subsequence is "psspt".

Constraints:

  • 1 <= s1.length, s2.length <= 1000`
  • s1 and s2 consist of only lowercase English characters.

Basic Solution

A basic brute-force solution could be to try all subsequences of 's1' and 's2' to find the longest one. We can match both the strings one character at a time. So for every index 'i' in 's1' and 'j' in 's2' we must choose between:

  1. If the character s1[i] matches s2[j], we can recursively match for the remaining lengths.
  2. If the character s1[i] does not match s2[j], we will start two new recursive calls by skipping one character separately from each string.

Here is the code:

Java

. . . .

The time complexity of the above algorithm is exponential , where 'm' and 'n' are the lengths of the two input strings. The space complexity is which is used to store the recursion stack.

Top-down Dynamic Programming with Memoization

We can use an array to store the already solved subproblems.

The two changing values to our recursive function are the two indexes, i1 and i2. Therefore, we can store the results of all the subproblems in a two-dimensional array. (Another alternative could be to use a hash-table whose key would be a string (i1 + "|" + i2)).

Here is the code:

Java

. . . .

Bottom-up Dynamic Programming

Since we want to match all the subsequences of the given two strings, we can use a two-dimensional array to store our results. The lengths of the two strings will define the size of the array's two dimensions. So for every index 'i' in string 's1' and 'j' in string 's2', we will choose one of the following two options:

  1. If the character s1[i] matches s2[j], the length of the common subsequence would be one plus the length of the common subsequence till the i-1 and j-1 indexes in the two respective strings.
  2. If the character s1[i] does not match s2[j], we will take the longest subsequence by either skipping ith or jth character from the respective strings.

So our recursive formula would be:

if s1[i] == s2[j] 
  dp[i][j] = 1 + dp[i-1][j-1]
else 
  dp[i][j] = max(dp[i-1][j], dp[i][j-1])

Let's draw this visually for "abcda" and "cbda". Starting with a subsequence of zero lengths, if any string has zero length then the common subsequence will be of zero length:

i:0, j:0-5 and i:0-4, j:0 => dp[i][j] = 0, as we don't have any common subsequence when one of the string is of zero length
i:0, j:0-5 and i:0-4, j:0 => dp[i][j] = 0, as we don't have any common subsequence when one of the string is of zero length
i:1, j:1 => dp[i][j] = max(dp[i-1][j], dp[i][j-1]), as s1[i] != s2[j]
i:1, j:1 => dp[i][j] = max(dp[i-1][j], dp[i][j-1]), as s1[i] != s2[j]
i:1, j:4 => dp[i][j] = 1 + dp[i-1][j-1], as s1[i] == s2[j]
i:1, j:4 => dp[i][j] = 1 + dp[i-1][j-1], as s1[i] == s2[j]
i:1, j:5 => dp[i][j] = max(dp[i-1][j], dp[i][j-1]), as s1[i] != s2[j]
i:1, j:5 => dp[i][j] = max(dp[i-1][j], dp[i][j-1]), as s1[i] != s2[j]
i:2, j:2=> dp[i][j] = 1 + dp[i-1][j-1], as s1[i] == s2[j]
i:2, j:2=> dp[i][j] = 1 + dp[i-1][j-1], as s1[i] == s2[j]
i:2, j:3-5 => dp[i][j] = max(dp[i-1][j], dp[i][j-1]), as s1[i] != s2[j]
i:2, j:3-5 => dp[i][j] = max(dp[i-1][j], dp[i][j-1]), as s1[i] != s2[j]
i:3, j:3=> dp[i][j] = 1 + dp[i-1][j-1], as s1[i] == s2[j]
i:3, j:3=> dp[i][j] = 1 + dp[i-1][j-1], as s1[i] == s2[j]
i:4, j:5=> dp[i][j] = 1 + dp[i-1][j-1], as s1[i] == s2[j]
i:4, j:5=> dp[i][j] = 1 + dp[i-1][j-1], as s1[i] == s2[j]
i:4, j:5=> dp[i][j] = 1 + dp[i-1][j-1], as s1[i] == s2[j]
i:4, j:5=> dp[i][j] = 1 + dp[i-1][j-1], as s1[i] == s2[j]

From the above visualization, we can clearly see that the longest common subsequence is of length '3' -- as shown by dp[4][5].

Here is the code for our bottom-up dynamic programming approach:

Java

. . . .

The time and space complexity of the above algorithm is , where 'm' and 'n' are the lengths of the two input strings.

Challenge

Can we further improve our bottom-up DP solution? Can you find an algorithm that has space complexity?

Hint

We only need one previous row to find the optimal solution!

Java

. . . .
Longest Common Subsequence (medium)
Rotting Oranges (medium)
Mark as Completed

On this page

Problem Statement

Basic Solution

Top-down Dynamic Programming with Memoization

Bottom-up Dynamic Programming

Challenge

Hint